package com.zzi.leeCode.findNodes;

//遍历一个二维数组对象，已知其中一个节点，输出其他点，不可重复输出

public class Node {
	private String value;
	private Node right;
	private Node left;
	private Node top;
	private Node bottom;
	@Override
	public String toString() {
		return "Node [value=" + value + "]";
	}
	public String getValue() {
		return value;
	}
	public void setValue(String value) {
		this.value = value;
	}
	public Node getRight() {
		return right;
	}
	public void setRight(Node right) {
		this.right = right;
	}
	public Node getLeft() {
		return left;
	}
	public void setLeft(Node left) {
		this.left = left;
	}
	public Node getTop() {
		return top;
	}
	public void setTop(Node top) {
		this.top = top;
	}
	public Node getBottom() {
		return bottom;
	}
	public void setBottom(Node bottom) {
		this.bottom = bottom;
	}
}

